Scaling End-to-End Multicast Transports with a Topologically-Sensitive Group Formation Protocol

نویسندگان

  • Sylvia Ratnasamy
  • Steven McCanne
چکیده

While the IP unicast service has proven successful, extending end-to-end adaptation to multicast has been a difficult problem. Unlike the unicast case, multicast protocols must support large and heterogeneous receiver sets. While proposed approaches to scaling multicast transports attempt to localize problems and/or organize receivers into a hierarchy through a divide-and-conquer approach, this approach succeeds only if the resulting hierarchy is congruent with the underlying routing tree topology. This implies the need for some level of topological information at the end systems which the IP multicast service deliberately hides. In this paper, we present a Group Formation Protocol (GFP) whereby receivers dynamically organize themselves into a multilevel hierarchy of multicast groups that corresponds to the underlying routing tree. GFP can serve as a core component across a wide range of multicast applications and protocols such as local recovery for reliable multicast, self organized transcoding, self organizing web caches, the optimal and dynamic placement of proxies, repeaters, designated receivers, recorders and so forth.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Scaling Multicast Transports through End-to-end Topology Discovery Scaling Multicast Transports through End-to-end Topology Discovery Abstract Scaling Multicast Transports through End-to-end Topology Discovery

The IP service model retains its simplicity and robustness by deferring reliability and congestion control to higher layers through end-to-end transport protocols. While the IP uni-cast service has proven successful, extending end-to-end adaptation to multicast has been a diicult problem. Unlike the unicast case, multicast protocols must support large and heterogeneous receiver sets. While prop...

متن کامل

Techniques for Making IP Multicast Simple and Scalable

This paper describes Root Administered Multicast Addressing (RAMA), a protocol for wide-area IP multicast that scales to a large number of simultaneous groups with topologically distant members. RAMA solves the widearea “rendezvous” problem by making the root of the distribution tree explicit in the multicast group identifier. This is done by extending the 4-byte IPv4 multicast group address fo...

متن کامل

MESH: Distributed Error Recovery for Multimedia Streams in Wide-Area Multicast Networks

This paper addresses support for multi-party multimedia applications delivered across datagram wide-area networks such as the Internet. Our approach is to develop a novel retransmission protocol framework, MESH, that protects delay-sensitive multicast data streams against most network errors and delay variations. The MESH approach partitions the multicast group into subgroups, elects subgroup m...

متن کامل

Simple Scalable Internet Multicast Ucl Research Note Rn/99/21

Despite years of attempting to nd a solution to Internet-wide IP multicast acceptable to both In-ternet Service Providers (ISPs) and end-users (applications), the solutions that have emerged are either relatively complex requiring signiicant administrative and protocol coordination, or have been found to be lacking in one or more crucial respects. This paper introduces Simple Multicast(SM), a n...

متن کامل

A Protocol for Scalable Application Layer Multicast

We describe a new application-layer multicast protocol that is speciically designed to scale to large groups. Our scheme is based upon a hierarchical clustering of the application-layer multicast peers and can be used to produce a number of diierent data delivery trees with speciic properties. On average, group members using our protocol maintain only a constant amount of state about other grou...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1999